std::priority_queue::top

From Cppreference

C++ Standard Library
Language Utilities library Strings library Containers library Algorithms library Iterators library Numerics library Input/output library Localizations library Regular expressions library (C++11) Atomic operations library (C++11) Thread support library (C++11)
Containers library
array (C++11) vector deque forward_list (C++11) list set multiset map multimap unordered_set (C++11) unordered_multiset (C++11) unordered_map (C++11) unordered_multimap (C++11) stack queue priority_queue
std::priority_queue
Member functions priority_queue::priority_queue priority_queue::~priority_queue priority_queue::operator= Element access priority_queue::top Capacity priority_queue::empty priority_queue::size Modifiers priority_queue::push priority_queue::emplace priority_queue::pop priority_queue::swap

reference top();		(C++11 feature)
const_reference top() const;

Returns reference to the top element in the priority queue. This element will be removed on a call to pop(). If default comparison function is used, the returned element is also the greatest among the elements in the queue.

Contents 1 Parameters 2 Return value 3 Complexity 4 See also

[edit] Parameters

(none)

[edit] Return value

Reference to the top element as if obtained by a call to c.back() (C++11 version)

Reference to the top element as if obtained by a call to c.front() (pre-C++11 version)

[edit] Complexity

constant

[edit] See also

pop	removes the first element (public member function)